Algorithm for finding the largest inscribed rectangle in polygon

Finding the Largest Area Axis-parallel Rectangle in a Polygon

This paper considers the geometric optimization problem of nding the Largest area axis-parallel Rectangle (LR) in an n-vertex general polygon. We characterize the LR for general polygons by considering diierent cases based on the types of contacts between the rectangle and the polygon. A general framework is presented for solving a key subproblem of the LR problem which dominates the running ti...

Computing the largest inscribed isothetic rectangle

This paper describes an algorithm to compute, in (log n) time, a rectangle that is contained in a convex n-gon, has sides parallel to the coordinate axes, and has maximum area. With a slight modiication it will compute the smallest perimeter. The algorithm uses a tentative prune-and-search approach, even though this problem does not appear to t into the functional framework of Kirkpatrick and S...

Finding the largest axis aligned rectangle in a polygon in o(n log n) time

Finding the Maximum Area Axis-parallel Rectangle in a Polygon

We consider the geometric optimization problem of nding the maximum area axis-parallel rectangle (MAAPR) in an n-vertex general polygon. We characterize the MAAPR for general polygons by considering di erent cases based on the types of contacts between the rectangle and the polygon. We present a general framework for solving a key subcase of the MAAPR problem which dominates the running time fo...

Enumeration of polyominoes inscribed in a rectangle

Computing the Largest Empty Rectangle

We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] ...